Semi-group, group quotient and homogeneous automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of a group in general fuzzy automata

 ‎Let $tilde{F}=(Q,S,tilde{R},Z,omega,tilde{delta},‎ F_1,F_2)$‎ ‎be a general fuzzy automaton and the set of its states be a group.‎ ‎The aim of this paper is the study of applications of a group in a‎ ‎general fuzzy automaton‎. ‎For this purpose‎, ‎we define the concepts‎ ‎of fuzzy normal kernel of a general fuzzy automaton‎, ‎fuzzy kernel‎ ‎of a general fuzzy automaton‎, ‎adjustable‎, ‎multip...

متن کامل

Random Group Automata

A group automaton is a complete deterministic automaton such that each letter of the alphabet acts on the set of states as a permutation 1, 5]. The aim is to describe an algorithm for the random generation of a minimal group automaton with n states. The treatment is largely based on properties of random permutations and random automata.

متن کامل

Heterogeneous and Homogeneous Robot Group Behavior

Dani Goldberg Brandeis University Computer Science Department Volen Center for Complex Systems, Room 261 Waltham, MA 02254 [email protected] When working with groups of robots it may be very di cult to determine what characteristics the group requires in order to perform a task most e ciently|i.e., in the least time. Some researchers have used groups of behaviorally di erentiated robots|wher...

متن کامل

1996-Heterogeneous and Homogeneous Robot Group Behavior

When working with groups of robots it may be very difficult to determine what characteristics the group requires in order to perform a task most efficiently-i.e., in the least time. Some researchers have used groups of behaviorally differentiated robots-where the robots do not perform the same actions-and others have used behaviorally homogeneous groups. None of this research, however, explicit...

متن کامل

Cellular Automata on Group Sets

The present dissertation studies cellular automata whose cell spaces are not as usual the integers or groups but merely sets that are acted transitively upon by groups. These cell spaces can be continuous like the real numbers acted upon by translations or the sphere acted upon by rotations, or discrete like vertex-transitive graphs acted upon by graph automorphisms or uniform tilings of the hy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1980

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(80)90277-6